Covering a Ball with Smaller Equal Balls in Rn
نویسنده
چکیده
We give an explicit upper bound of the minimal number of balls of radius 1/2 which form a covering of a ball of radius T > 1/2 in R, n > 2.
منابع مشابه
Covering a ball with smaller equal balls in R
We give an explicit upper bound of the minimal number νT,n of balls of radius 1/2 which form a covering of a ball of radius T > 1/2 in R , n > 2. The asymptotic estimates of νT,n we deduce when n is large are improved further by recent results of Böröczky Jr. and Wintsche on the asymptotic estimates of the minimal number of equal balls of R n covering the sphere S. The optimality of the asympto...
متن کاملOn symplectic folding
We study the rigidity and flexibility of symplectic embeddings of simple shapes. It is first proved that under the condition r n ≤ 2r 1 the symplectic ellipsoid E(r1, . . . , rn) with radii r1 ≤ · · · ≤ rn does not embed in a ball of radius strictly smaller than rn. We then use symplectic folding to see that this condition is sharp and to construct some nearly optimal embeddings of ellipsoids a...
متن کاملNew bounds for multiple packings of Euclidean sphere
Using lower bounds on distance spectrum components of a code on the Euclidean sphere, we improve the known asymptotical upper bounds on the cardinality of multiple packings of the sphere by balls of smaller radii. Let Rn be the n-dimensional Euclidean space, and Sn−1(r) ⊂ Rn be the (closed) Euclidean sphere of radius r with the center in the origin. Let further S̃n−1(r, ā) be the open ball of ra...
متن کاملGeneralized Space Forms
Spaces with radially symmetric curvature at base point p are shown to be diffeomorphic to space forms. Furthermore, they are either isometric to Rn or Sn under a radially symmetric metric, to RPn with Riemannian universal covering of Sn equipped with a radially symmetric metric, or else have constant curvature outside a metric ball of radius equal to the injectivity
متن کاملBalanced offline allocation of weighted balls into bins
We propose a sorting-based greedy algorithm called SortedGreedy[m] for approximately solving the offline version of the d-choice weighted balls-into-bins problem where the number of choices for each ball is equal to the number of bins. We assume the ball weights to be nonnegative. We compare the performance of the sorting-based algorithm with a näıve algorithm called Greedy[m]. We show that by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 33 شماره
صفحات -
تاریخ انتشار 2005